import java.util.ArrayList;
import java.util.Queue;
import java.util.Scanner;

/**
 * Created with IntelliJ IEDA.
 * Description:
 * User:86186
 * Date:2023-04-28
 * Time:21:18
 */

/**
 * Jz29 顺时针打印矩阵
 */

public class printMatrix {
    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        // 注意 hasNext 和 hasNextLine 的区别
        while (in.hasNextInt()) { // 注意 while 处理多个 case
            int a = in.nextInt();
            int b = in.nextInt();
            System.out.println(a + b);
        }
    }

    //    public int[] printMatrix(int [][] matrix) {
//        int row = matrix[0].length;
//        int col = matrix.length;
//        int[] num = new int[row * col];
//        int jud = 0;
//        int index = 0;
//        while (jud <= col){
//            if (jud % 2 == 0){
//                for (int i = 0; i < row; i++) {
//                    num[index++] = matrix[jud][i];
//                }
//                jud++;
//            }else if (jud % 2 == 1){
//                for (int i = row - 1; i >= 0; i--) {
//                    num[index++] = matrix[jud][i];
//                }
//                jud++;
//            }
//        }
//        return num;
//    }
    public ArrayList<Integer> printMatrix(int[][] matrix) {
        int n = matrix.length;
        int m = matrix[0].length;
        int step = 0;
        int i = 0, j = -1;
        int total = 0;
        ArrayList<Integer> arrayList = new ArrayList<Integer>();
        while (total < n * m) {
            for (++j; j < m - step && total < n * m; j++, total++) {
                arrayList.add(matrix[i][j]);
            }
            j--;
            for (++i; i < n - step && total < n * m; i++, total++) {
                arrayList.add(matrix[i][j]);
            }
            i--;
            for (--j; j >= step && total < n * m; j--, total++) {
                arrayList.add(matrix[i][j]);
            }
            j++;
            for (--i; i > step && total < n * m; i--, total++) {
                arrayList.add(matrix[i][j]);
            }
            i++;
            step++;

        }
        return arrayList;
    }

}
